Principalization algorithm via class group structure
نویسندگان
چکیده
منابع مشابه
Threshold Estimation via Group Orthogonal Greedy Algorithm
Disclaimer: This is a version of an unedited manuscript that has been accepted for publication. As a service to authors and researchers we are providing this version of the accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proof will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may...
متن کاملAppendix: Sharing Features in Multi-class Boosting via Group Sparsity
In this document we provide a complete derivation for multi-class boosting with group sparsity and a full explanation of admm algorithm presented in the main paper. 1 Multi-class boosting with group sparsity We first provide the derivation for multi-class logistic loss with 1,2-norm. We then show the difference between our boosting with 1,2-norm and 1,∞-norm. We then briefly discuss our group s...
متن کاملMonomial Principalization in the Singular Setting
We generalize an algorithm by Goward for principalization of monomial ideals in nonsingular varieties to work on any scheme of finite type over a field. The normal crossings condition considered by Goward is weakened to the condition that components of the generating divisors meet as complete intersections.
متن کاملCohomological Structure of the Mapping Class Group and Beyond
In this paper, we briefly review some of the known results concerning the cohomological structures of the mapping class group of surfaces, the outer automorphism group of free groups, the diffeomorphism group of surfaces as well as various subgroups of them such as the Torelli group, the IA outer automorphism group of free groups, the symplectomorphism group of surfaces. Based on these, we pres...
متن کاملA space efficient algorithm for group structure computation
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order. We estimate the computational complexity by counting the group operations such as multiplications and equality checks. Under some plausible assumptions, we prove that the expected run time is O( √ n) (with n denoting t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2014
ISSN: 1246-7405,2118-8572
DOI: 10.5802/jtnb.874